Probabilistic Approach to Scheduling Divisible Load on Network of Processors

An Exhaustive Approach to Release Time Aware Divisible Load Scheduling

An interesting optimization problem is examined where optimal load allocations depend on processor release times, but the timing of release times depends on the load allocation scenario used. This circular relationship between an optimal solution and release times causes system models whose timing relationships may not have an optimal solution. To obtain an optimal solution based on an assumed ...

Divisible Load Scheduling and Markov Chain Models

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree netw...

Divisible Load Scheduling in Distributed Computing Environments

When attempting to achieve a time-consuming computation it is often advantageous to split the computation amongst multiple machines. Splitting a computation leads to the question of how to divide the load amongst the machines. If we assume that the load can be arbitrarily split and that there are no precedence relations amongst pieces of the load, we call the load divisible. One example of a di...

Divisible Load Scheduling for Grid Computing

The use of divisible load scheduling theory is proposed to model and design grid systems such as those arising in large physics experiments. Current divisible load theory is summarized. A typical application, the STAR experiment at RHIC is discussed. This includes a sample calculation based on existing infrastructure numbers.

The Combinatorics in Divisible Load Scheduling